Complete coset weight distributions of second order Reed - Muller code of length 64 Michio Ozeki and Katsushi Waki
نویسندگان
چکیده
In this paper we determine the complete coset weight distributions of the second order Reed-Muller code RM(2, 6) of length 64. Our method fully uses the interaction between the Jacobi polynomials for the code RM(2, 6) and those of the dual code RM(3, 6). The method also employs the group theoretic reduction processes to diminish the runtimes of computing the Jacobi polynomials for the code RM(2, 6) in great effect.
منابع مشابه
On the weight distributions of optimal cosets of the first-order Reed-Muller codes
We study the weight distributions of cosets of the first-order Reed–Muller code (1 ) for odd , whose minimum weight is greater than or equal to the so-called quadratic bound. Some general restrictions on the weight distribution of a coset of (1 ) are obtained by partitioning its words according to their weight divisibility. Most notably, we show that there are exactly five weight distributions ...
متن کاملLocal Weight Distribution of the (256, 93) Third-Order Binary Reed-Muller Code
Local weight distribution is the weight distribution of minimal codewords in a linear code. We give the local weight distribution of the (256, 93) third-order binary Reed-Muller code. For the computation, a coset partitioning algorithm is modified by using a binary shift invariance property. This reduces the time complexity by about 1/256 for the code. A necessary and sufficient condition for m...
متن کاملOn binary codes related to mutually quasi-unbiased weighing matrices
Some mutually quasi-unbiased weighing matrices are constructed from binary codes satisfying the conditions that the number of non-zero weights of the code is four and the code contains the first order Reed–Muller code. Motivated by this, in this note, we study binary codes satisfying the conditions. The weight distributions of binary codes satisfying the conditions are determined. We also give ...
متن کاملCoset Analysis of Reed Muller Codes Via Translates of Finite Vector Spaces
In order to calculate the error probability of a code it is necessary to know the distribution of the coset leaders. The enumeration of cosets of the first order Reed Muller code has been studied (i) by Berlekamp and Welch (1972) by associating with each coset a class of Boolean functions, and (ii) by Sloane and Dick (1971) by associating with each coset a class of single-error-correcting codes...
متن کاملOn cryptographic properties of the cosets of R(1, m)
We introduce a new approach for the study of weight distributions of cosets of the Reed–Muller code of order 1. Our approach is based on the method introduced by Kasami in [1], using Pless identities. By interpreting some equations, we obtain a necessary condition for a coset to have a “high” minimum weight. Most notably, we are able to distinguish such cosets which have three weights only. We ...
متن کامل